The Representation of Indiscernibility Relation Using ZBDDs
نویسندگان
چکیده
The indiscernibility relation is the basic concept in Rough set theory, a novel representation of indiscernibility relation using Zero-Suppressed BDDs is proposed in this paper. Through introducing the indiscernibility matrix and the indiscernibility graph, we put forward the encoding of the variable and give the characteristic function. Once the characteristic function is constructed, it can be represented using ZBDDs.And further, combined with an example, we analyze the effectiveness of this method. It provides a basis for deal with rough set computing.
منابع مشابه
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound number of clusters. Rough set based Indiscernibility relation combined with indiscernibility graph, leads to knowledge discovery in an elegant way. Indiscernibilty relation has a strong appeal to be applied in clustering...
متن کاملGeneralized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theory are based on the assumption that objects are perceived by attribute value vectors. We propose the new point of view on rough set theory. We replace information systems with the knowledge representation models that i...
متن کاملN-Gram Analysis Based on Zero-Suppressed BDDs
In present paper, we propose a new method of n-gram analysis using ZBDDs (Zero-suppressed BDDs). ZBDDs are known as a compact representation of combinatorial item sets. Here, we newly apply the ZBDD-based techniques for efficiently handling sets of sequences. Using the algebraic operations defined over ZBDDs, such as union, intersection, difference, etc., we can execute various processings and/...
متن کاملZBDD-Based Backtrack Search SAT Solver
We introduce a new approach to Boolean satisfiability that combines backtrack search techniques and zero-suppressed binary decision diagrams (ZBDDs). This approach implicitly represents satisfiability instances using ZBDDs, and performs search using an efficient implementation of unit propagation on the ZBDD structure. We describe how to perform backtrack search using ZBDDs as the underlying st...
متن کاملA Theoretical Study on Variable Ordering of ZBDDs for Representing Frequent Itemsets
(Abstract) Recently, an efficient method of database analysis using Zero-suppressed Binary Decision Diagrams (ZBDDs) has been proposed. BDDs are a graph-based representation of Boolean functions, now widely used in system design and verification. Here we focus on ZBDDs, a special type of BDDs, which are suitable for handling large-scale combinatorial itemsets in frequent item-set mining. In gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012